Chase-Like Bounded-Distance Decoding with O(d2/3) Trials
نویسندگان
چکیده
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses O(d) trials of a conventional binary decoder. In this paper, we propose a class of Chase-like BD decoding algorithms of even lower complexity than the original Chase-3 algorithm. In particular, the least complex member of this class requires only O(d2/3) trials.
منابع مشابه
Low-complexity Chase-like bounded-distance decoding algorithms
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve boundeddistance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses about d/2 trial...
متن کاملGeometrical and performance analysis of GMD and Chase decoding algorithms
The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by No;e = No + NBDD; where NBDD denotes the number of additional, noncodeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original Generalized Minimum Distance (GMD) and Chase decoding algorithms. After car...
متن کاملA New Chase-type Soft-decision Decoding Algorithm for Reed-Solomon Codes
This paper addresses three relevant issues arising in designing Chase-type algorithms for ReedSolomon codes: 1) how to choose the set of testing patterns; 2) given the set of testing patterns, what is the optimal testing order in the sense that the most-likely codeword is expected to appear earlier; and 3) how to identify the most-likely codeword. A new Chase-type soft-decision decoding algorit...
متن کاملOptimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders
We investigate threshold–based multi–trial decoding of concatenated codes with an inner Maximum–Likelihood decoder and an outer error/erasure l+1 l –extended Bounded Distance decoder, i.e. a decoder which corrects ε errors and τ erasures if l+1 l ε+τ ≤ d−1, where d is the minimum distance of the outer code and l ∈ N\{0}. This is a generalization of Forney’s GMD decoding, which was considered on...
متن کاملEfficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
Abstmct Two soft-decision algorithms f o r decoding the (6,3,4) q u a t e r n a r y code, the hezocode, are p resented. Both algorithms have the same guaranteed error cor rec t ion radius as that of maximum-likelihood decoding. In using them, bounded-distance decoding of the Golay code and the Leech lattice are performed i n at most 187 and 519 real operations respectively. We present s o m e s...
متن کامل